M-ary ask OFDM

ABSTRACT

A coherent MASK-OFDM digital communication system that includes logics for modulating and demodulating digital signals to be communicated using M-ary amplitude shift keying (MASK) and orthogonal frequency division multiplexing (OFDM) is provided. This MASK-OFDM system can be implemented digitally by discrete cosine transform (DCT) and inverse discrete cosine transform (IDCT). The (I)DCT can be implemented, for example, by an (I)FCT.  
     It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the application. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. 37 CFR 1.72(b).

CROSS REFERENCE TO RELATED APPLICATION

[0001] This application claims priority to the U.S. Provisional Application No. 60/386,843, filed Jun. 7, 2002, titled Coherent M-ary Amplitude Shift Keying OFDM System, which is incorporated herein by reference.

TECHNICAL FIELD

[0002] The methods, systems, and computer readable media described herein relate generally to digital communications and more specifically to digital communication systems and methods that employ M-ary amplitude shift keying (MASK) modulation and orthogonal frequency division multiplexing (OFDM).

BACKGROUND

[0003] Characteristics of conventional systems like null-to-null bandwidth, symbol rate, bit error rate, highest null point in power spectral density (PSD), lowest null frequency, and so on are described to facilitate later comparison to the MASK-OFDM systems and methods described herein.

[0004] Digital communications systems and methods that more efficiently use bandwidth are desirable. Conventional digital communications employing quadrature amplitude modulation (QAM) OFDM or M-ary phase shift keying (MPSK) OFDM employ a minimum frequency separation of 1/T, where T is the symbol duration. The bandwidth for these systems is determined by the frequency separation. Prior Art FIG. 1 illustrates that the total null-to-null bandwidth of these conventional systems is: ${{BW}_{QP} = \frac{\left( {N + 1} \right)}{T}},\left( {{{QAM}\text{-}{OFDM}},{{MPSK}\text{-}{OFDM}}} \right)$

[0005] Similarly, digital communication systems and methods with improved bit error rate (BER) are desirable. The BER for conventional MPSK-OFDM and QAM-OFDM systems in an additive white Gaussian noise (AWGN) channel are: ${P_{b} \approx {\frac{2}{k}{Q\left( {\sqrt{\frac{2{kE}_{b}}{N_{0}}}\sin \quad \frac{\pi}{M}} \right)}}},\begin{matrix} \quad & ({MPSK}) \end{matrix}$

${P_{b} \approx {\frac{4\left( {\sqrt{M} - 1} \right)}{k\sqrt{M}}{Q\left( {\sqrt{\frac{3k}{\left( {M - 1} \right)}}\frac{E_{b}}{N_{0}}} \right)}}}\quad,\begin{matrix} \quad & ({QAM}) \end{matrix}$

[0006] where k=log₂M is the number of bits per symbol and where: ${Q(x)} = {\int_{x}^{\infty}{\frac{1}{\sqrt{2\quad \pi}}^{- \frac{x^{2}}{2}}{{x}\quad.}}}$

[0007] Systems and methods that reduce spectral aliasing are desired. For QAM-OFDM or MPSK-OFDM the highest null point in its PSD is f_(h)=N/T. The lowest null point frequency is f₁=−1/T. Thus, to avoid severe aliasing in the spectrum of the sampled modulated signal, the sampling frequency is: $\begin{matrix} {{f_{s} \geq \left( {f_{h} - f_{l}} \right)} = {\frac{N + 1}{T} = \frac{\left( {N + 1} \right)R_{b}}{\log_{2}M}}} & \left( {{{QAM}\text{-}{OFDM}},{{MPSK}\text{-}{OFDM}}} \right) \end{matrix}$

[0008] where R_(b) is the bit rate of each channel. To further reduce aliasing, f, is typically chosen much higher than this. For example, f_(s) is often chosen as 2N/T. If N is a power of 2, 2N samples in a symbol period can be conveniently and efficiently generated by a 2N-point Fast Fourier Transform (FFT) with radix-2 algorithm. In terms of bit rate R_(b): $\begin{matrix} {f_{s} = {\frac{2N}{T} = \frac{2{NR}_{b}}{\log_{2}M}}} & \quad & \left( {{{QAM}\text{-}{OFDM}},{{MPSK}\text{-}{OFDM}}} \right) \end{matrix}$

[0009] Reducing power requirements and/or consumption can improve digital communication systems and methods. Reductions are particularly poignant to battery based systems. Due to orthogonality between different subcarriers, the total power in an OFDM system is the sum of the powers of the subcarriers P_(i), where: $P_{i} = {{\frac{1}{T}{\int_{0}^{T}{\left\lbrack {A_{i}{\cos \left( {{\omega_{i}t} + \varphi_{i}} \right)}} \right\rbrack^{2}{t}}}} = {\frac{1}{2}A_{i}^{2}}}$

[0010] where A_(i) cos(ω_(i)t+φ_(i)) is the i^(th) subcarrier with amplitude A_(i), angular frequency ω_(i), and initial phase φ_(i). From this it is inferred that the total average power equals the sum of the average powers of the subcarriers, as in: $P_{{avg}{({OFDM})}} = {{E\left\{ P_{total} \right\}} = {{\sum\limits_{i = 0}^{N - 1}{E\left\{ P_{i} \right\}}} = {\sum\limits_{i = 0}^{N - 1}P_{avgi}}}}$

[0011] where E{x} represents the statistical expectation of x.

[0012] Let QO represent QAM-OFDM and let PO represent PSK-OFDM. Peak power occurs when the subcarriers have the same maximum amplitudes. For QAM, the maximum amplitude is A_(max(QAM))={square root}{square root over (2)}({square root}{square root over (M)}−1) (the outermost point in the constellation, assuming QAM having a square constellation with amplitudes ±1, ±3, . . . ±({square root}{square root over (M)}−1) for its I and Q channel components), the maximum OFDM envelope is A_(peak(QO))=N{square root}{square root over (2)}({square root}{square root over (M)}−1), and the peak power is P_(peak(QO))=N²({square root}{square root over (M)}−1)². The average power of the square QAM signal on a single subcarrier is P_(avg)=(⅓)(M−1)P₀, where P₀ is the power of the smallest signal. For the assumed amplitude assignment, P₀=½{square root}{square root over (2)}²=1. Thus the average power of the QAM-OFDM signal on N subcarriers is P_(avg(QO))=(⅓)N(M−1), and the peak to average power ratio (PAPR) is: ${PAPR}_{({QO})} = {\frac{P_{{peak}{({QO})}}}{P_{{avg}{({QO})}}} = \frac{3{N\left( {\sqrt{M} - 1} \right)}}{\sqrt{M} + 1}}$

[0013] For MPSK, the amplitudes AMPSK of all subcarriers are the same all the time. Thus, the maximum OFDM envelope is A_(peak(PO))=NA_(MPSK), the peak power is P_(peak(PO))=½N²A²MPSK, and the average power is P_(avg(PO))=(½)NA² _(MPSK). Thus, the PAPR is: ${PAPR}_{({QO})} = {\frac{P_{{peak}{({PO})}}}{P_{{avg}{({PO})}}} = N}$

[0014] Reducing hardware and computational complexity simplifies digital communications systems and methods. Conventional QAM-OFDM and MPSK-OFDM are implemented with hardware and/or software that perform discrete Fourier transforms (DFT) and inverse discrete Fourier transforms (IDFT). MASK-OFDM has conventionally not been implemented with DFT and IDFT because the frequency separation is 1/(2T) instead of 1/T. Conventional QAM-OFDM and MPSK-OFDM may employ fast Fourier transform (FFT) and inverse FFT (IFFT), which employ complex number (e.g., real and imaginary components) operations. For an N-point FFT or IFFT, (N/2)log₂N complex number multiplications and Nlog₂N complex number additions are employed. An N-subcarrier QAM-OFDM or MPSK-OFDM requires a 2N-point IFFT/FFT, which requires N(log₂N+1) complex number multiplications and 2N(log₂N+1) complex additions.

[0015] OFDM receiving apparatus have been described that include processing a reference symbol that is an ASK-modulated pseudo-random number. In U.S. Pat. No. 6,169,751 titled “OFDM Receiving Apparatus”, filed Mar. 9, 1998 and issued Jan. 2, 2001, an OFDM receiving apparatus is described. The apparatus employs conventional QAM and FFT processing for data symbols. In one example, the OFDM receiving apparatus performs synchronization processes that include processing a reference symbol that is an ASK-modulated pseudo-random number. Note that this is ASK and not M-ary ASK and that the single character processed is a reference symbol and not a data signal.

SUMMARY

[0016] The following presents a simplified summary of systems, methods, and computer readable media described herein to facilitate providing a basic understanding of these items. This summary is not an extensive overview and is not intended to identify key or critical elements of the systems, methods and so on or to delineate the scope of these items. This summary provides a conceptual introduction in a simplified form as a prelude to the more detailed description that is presented later.

[0017] Coherent MASK-OFDM data communication systems and methods are described. MASK-OFDM systems and methods facilitate employing 1/(2T) frequency separation as opposed to conventional 1/T frequency separation. This facilitates more efficiently utilizing bandwidth. By selectively widening the narrowed bandwidth possible through MASK-OFDM systems and methods, it is possible to achieve a BER equivalent to QAM-OFDM systems or better than MPSK-OFDM systems.

[0018] Coherent MASK-OFDM digital communication systems and methods can be implemented digitally using a discrete cosine transform (DCT) for modulation and an inverse DCT (IDCT) for demodulation. Digital DCT and IDCT can be implemented using real number operations as opposed to complex (real+imaginary) number operations, thereby reducing processing time and complexity. Therefore, less hardware is required to implement the coherent MASK-OFDM digital communication systems and methods than conventional systems. Once again this facilitates reducing power requirements. In one example, the DCT and IDCT can be implemented using a Fast Cosine Transform (FCT) and an inverse FCT (IFCT).

[0019] Certain illustrative example systems, methods, and computer readable media are described herein in connection with the following description and the annexed drawings. These examples are indicative, however, of but a few of the various ways in which the principles of the examples may be employed and thus are intended to be inclusive of equivalents. Other advantages and novel features may become apparent from the following detailed description when considered in conjunction with the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[0020] Prior Art FIG. 1 illustrates spectra of QAM/PSK-OFDM subcarriers with 1/T separation.

[0021]FIG. 2 illustrates spectra of MASK-OFDM subcarriers with 1/(2T) separation.

[0022]FIG. 3 illustrates BERs for MASK, MQAM and MPSK.

[0023]FIG. 4 illustrates MASK and OFDM employing DCT components.

[0024]FIG. 5 illustrates an example MASK-OFDM modulation system.

[0025]FIG. 6 illustrates an example MASK-OFDM modulation system.

[0026]FIG. 7 illustrates modulation system components.

[0027]FIG. 8 illustrates demodulation system components.

[0028]FIG. 9 illustrates an example MASK-OFDM demodulation system.

[0029]FIG. 10 illustrates an example MASK-OFDM demodulation system.

[0030]FIG. 11 illustrates a modulator/demodulator employing MASK-OFDM.

[0031]FIG. 12 illustrates a method for modulating and multiplexing data.

[0032]FIG. 13 illustrates a method for demultiplexing and demodulating data.

[0033]FIG. 14 is a schematic block diagram of an example computing environment with which the systems and methods described herein can interact.

[0034]FIG. 15 illustrates 8ASK and 64QAM constellations.

DETAILED DESCRIPTION

[0035] Example methods, systems, and computer media are now described with reference to the drawings, where like reference numerals are used to refer to like elements throughout. In the following description for purposes of explanation, numerous specific details are set forth in order to facilitate thoroughly understanding the examples. It may be evident, however, that the examples can be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to simplify description.

[0036] As used in this application, the term “digital communication component” refers to a digital communication related entity, either hardware, firmware, software, a combination thereof, or software in execution. For example, a digital communication component can be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, a device, a subsystem, an integrated circuit, an electronic device, and a computer. By way of illustration, both an application running on a server and the server can be digital communication components. One or more digital communication components can reside within a process and/or thread of execution and a digital communication component can be localized and/or distributed between two or more physical devices.

[0037] “Data store”, as used herein, refers to a physical and/or logical entity that can store data. A data store may be, for example, a database, a table, a file, a list, a queue, a heap, a register, a memory, and so on. A data store may reside in one logical and/or physical entity and/or may be distributed between two or more logical and/or physical entities.

[0038] “Signal”, as used herein, includes but is not limited to one or more electrical or optical signals, analog or digital, one or more computer instructions, a bit or bit stream, or the like.

[0039] “Software”, as used herein, includes but is not limited to, one or more computer readable and/or executable instructions that cause a computer, digital communication component, or other electronic device to perform functions, actions and/or behave in a desired manner. The instructions may be embodied in various forms like routines, algorithms, modules, methods, threads, and/or programs. Software may also be implemented in a variety of executable and/or loadable forms including, but not limited to, a stand-alone program, a function call (local and/or remote), a servelet, an applet, instructions stored in a memory, part of an operating system or browser, and the like. It is to be appreciated that the computer readable and/or executable instructions can be located in one digital communication component, one computer, and/or distributed between two or more communicating, co-operating, and/or parallel processing digital communication components and computers and thus can be loaded and/or executed in serial, parallel, massively parallel and other manners.

[0040] “Logic”, as used herein, includes but is not limited to hardware, firmware, software and/or combinations of each to perform function(s) or action(s). For example, based on a desired application or needs, logic may include a software controlled microprocessor, discrete logic such as an application specific integrated circuit (ASIC), or other programmed logic device. Logic may also be fully embodied as software. Where multiple logical logics are described, it may be possible to incorporate the multiple logical logics into one physical logic. Similarly, where a single logical logic is described, it may be possible to distribute that single logical logic between multiple physical logics.

[0041] Some portions of the detailed descriptions that follow are presented in terms of algorithms and symbolic representations of operations on data bits within a digital communication component and/or computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated.

[0042] It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like. It should be borne in mind, however, that these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussions, it is appreciated that throughout the description, discussions utilizing terms like processing, computing, calculating, determining, displaying, or the like, refer to the action and processes of a computer system, computer component, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other information storage, transmission or display devices.

[0043] It will be appreciated that some or all of the processes and methods of the system involve electronic and/or software applications that may be dynamic and flexible processes so that they may be performed in sequences different than those described herein. It will also be appreciated by one of ordinary skill in the art that elements embodied as software may be implemented using various programming approaches such as machine language, procedural, object oriented, and/or artificial intelligence techniques.

[0044] The processing, analyses, and/or other functions described herein may also be implemented by functionally equivalent circuits like a digital signal processor (DSP), a software controlled microprocessor, or an ASIC. Components implemented as software are not limited to any particular programming language. Rather, the description herein provides the information one skilled in the art may use to fabricate circuits or to generate computer software and/or computer components to perform the processing of the system. It will be appreciated that some or all of the functions and/or behaviors of the present system and method may be implemented as logic as defined above.

[0045] In one example, multiple subcarriers with frequencies different by half of the symbol rate are modulated by data symbols using coherent M-ary amplitude shift keying in a modulator in a transmitter. The resultant modulated multiple carriers are summed to form an orthogonal frequency division multiplexed signal. In one example, an FCT is employed to digitally implement the DCT employed in MASK-OFDM modulation.

[0046] Modulated multiple carriers are separated and demodulated in a receiver by a demodulator. In one example, an IFCT is employed to digitally implement the IDCT employed in MASK-OFDM demodulation. The MASK-OFDM modulation and demodulation facilitate communication systems, wired or wireless, communicating at similar or improved bit error rates with substantially the same bandwidth and reduced system and computational complexity compared to conventional QAM-OFDM and MPSK-OFDM systems.

[0047] Bandwidth is a precious commodity. Conventional digital communications systems and methods employing QAM OFDM or MPSK OFDM employ a minimum frequency separation of 1/T, where T is the symbol duration. The bandwidth for these systems is therefore determined by the frequency separation. Prior Art FIG. 1 illustrates that the total null-to-null bandwidth of such conventional systems is: ${{BW}_{QP} = \frac{\left( {N + 1} \right)}{T}},\left( {{{QAM}\text{-}{OFDM}},{{MPSK}\text{-}{OFDM}}} \right)$

[0048] In Prior Art FIG. 1, different carrier frequencies (e.g., 100, 110, 120, 130) are separated by 1/T, for a total bandwidth of N/T, where N is the number of subcarrier frequencies. Coherent MASK-OFDM systems and methods employ subcarriers that differ only in frequency and amplitude. If the phases for the subcarriers are the same (0, π/2, π) then the minimum frequency spacing can be reduced to 1/(2T) while maintaining orthogonality.

[0049] OFDM has gained widespread use in digital communications due to its high bandwidth efficiency. OFDM uses multiple orthogonal subcarriers with overlapped spectra at transmission. The spectral overlapping conserves bandwidth while the orthogonality between subcarriers facilitates separating the signals on the subcarriers at the receiver.

[0050] The OFDM signal has the general form: ${v(t)} = {\sum\limits_{i = 0}^{N - 1}{A_{i}{\cos \left( {{\omega_{i}t} + \varphi_{i}} \right)}}}$

[0051] where A_(i), ω_(i)=2 πf_(i), and φ_(i) are the amplitude, angular frequency, and phase of the ith subcarrier. N is the number of subcarriers. If the signal is amplitude shift keyed (ASK), A_(i) is determined by the data and φ_(i) is an initial phase that is usually assumed to be zero. If the signal is phase shift keyed (PSK), A_(i) is a constant and φ_(i) is determined by the data. If the signal is quadrature amplitude modulated (QAM), both A_(i) and φ_(i) are determined by the data. PSK and QAM are conventionally used with OFDM. These methods require a minimum 1/T frequency separation between subcarriers for orthogonality, T being the symbol duration. For f_(i) being an integer multiple of 1/(2T), and f_(i) and f_(j) being separated by 1/T: ${{\int_{0}^{T}{A_{i}A_{j}{\cos \left( {{\omega_{i}t} + \varphi_{i}} \right)}{\cos \left( {{\omega_{j}t} + \varphi_{j}} \right)}{t}}} = 0},\begin{matrix} \quad & {i \neq j} \end{matrix}$

[0052] and is nonzero otherwise.

[0053] However, for orthogonality, the minimum frequency separation of a coherent M-ary ASK-OFDM system is only 1/(2T). Thus, a MASK-OFDM signal can be written: ${v(t)} = {\sum\limits_{i = 0}^{N - 1}{A_{i}\cos \quad \omega_{i}t}}$

[0054] In the above expression, the phase id is zero for the subcarriers. This facilitates employing a 1/(2T) minimum separation for orthogonality since: ${{\int_{0}^{T}{A_{i}A_{j}\cos \quad \omega_{i}t\quad \cos \quad \omega_{j}t\quad {t}}} = 0},\begin{matrix} \quad & {i \neq j} \end{matrix}$

[0055] and is nonzero otherwise, for f_(i) being an integer multiple of 1/(2T) and f_(i) and f_(j) being separated by 1/(2T). Other forms of MASK-OFDM can include: $\begin{matrix} {{v(t)} = {\sum\limits_{i = 0}^{N - 1}{A_{i}{\cos \left( {{\omega_{i}t} + {\pi/2}} \right)}\quad {and}}}} \\ {{v(t)} = {\sum\limits_{i = 0}^{N - 1}{A_{i}\quad \cos \quad \left( {{\omega_{i}t} + \pi} \right)}}} \end{matrix}$

[0056] with f_(i) being an integer multiple of 1/(2T) and f_(i) being separated by 1/(2T).

[0057] Therefore, in one example, a coherent MASK-OFDM signal is: ${s(t)} = {\sum\limits_{k = 0}^{N - 1}{A_{k}\quad \cos \quad 2\pi \quad \frac{k}{2T}t}}$

[0058] where A_(k) is one of the M-ary amplitudes. Each subcarrier frequency f_(k)=k/(2T), where the k are contiguous integers. Thus, the frequency separation is 1/(2T).

[0059] In FIG. 2, different carrier frequencies (e.g., 200, 210, 220, 230) are separated by 1/(2T), for a total bandwidth of (N+3)/(2T), which is less than that required in Prior Art FIG. 1.

[0060] The signal orthogonality is verified by the following integration: $\begin{matrix} {{{\int_{0}^{T}{A_{i}A_{j}\cos \quad 2\quad \pi \quad \frac{i}{2T}t\quad \cos \quad 2\quad \pi \quad \frac{j}{2T}t{t}}} = 0},} & {i \neq j} \end{matrix}$

[0061] Prior Art FIG. 1 illustrates the spectra of four channel OFDM systems with 1/T spacing. FIG. 2 illustrates the spectra of four channel OFDM systems with 1/(2T) spacing. Prior Art FIG. 1 illustrates that the total null to null bandwidth of QAM-OFDM and MPSK-OFDM is: $\begin{matrix} {{BW}_{QP} = \frac{\left( {N + 1} \right)}{T}} & \quad & \left( {{{QAM}\text{-}{OFDM}},{{MPSK}\text{-}{OFDM}}} \right) \end{matrix}$

[0062] Similarly, FIG. 2 illustrates that the total null to null bandwidth for MASK-OFDM is: $\begin{matrix} {{BW}_{A} = \frac{\left( {N + 3} \right)}{2T}} & \quad & \left( {{MASK}\text{-}{OFDM}} \right) \end{matrix}$

[0063] Thus, MASK-OFDM illustrates a bandwidth savings over QAM-OFDM or MPSK-OFDM of:

[0064] BW_(savings)=2(N+1)/(N+3), which approaches 2 when N goes to infinity.

[0065] In some examples, for the same modulation order M, coherent MASK may have less power efficiency than coherent MPSK or QAM. Thus, in one example, bandwidth savings can be traded for power efficiency. For an approximately fixed bandwidth occupancy, when coherent MASK is employed for OFDM, the number of bits per symbol can be halved. The halving is possible because of the half subcarrier frequency spacing compared to MPSK or QAM. For example, M can be reduced to {square root}{square root over (M)} which recovers the power efficiency.

[0066] By way of illustration, consider QAM with amplitudes of ±1, ±3, . . . , ±({square root}{square root over (M)}−1) on both I and Q channels, and consider amplitudes of the MASK at ±1, ±3, . . . ±1 (M−1). Then the BER expressions for MASK and QAM for coherent receivers in an AWGN channel are: $\begin{matrix} \begin{matrix} {{P_{b} = {\frac{2\left( {M - 1} \right)}{kM}{Q\left( \sqrt{\left. {\frac{6k}{\left( {M^{2} - 1} \right)_{0}}\frac{E_{b}}{N_{0}}} \right)} \right)}}}\quad,} & \quad & ({MASK}) \end{matrix} & \left( {{Equation}\quad 1} \right) \\ \begin{matrix} {{P_{b} = {\frac{4\left( {\sqrt{M} - 1} \right)}{k\sqrt{M}}{Q\left( \sqrt{\left. {\frac{3k}{\left( {M - 1} \right)_{0}}\frac{E_{b}}{N_{0}}} \right)} \right)}}}\quad,} & \quad & ({QAM}) \end{matrix} & \left( {{Equation}\quad 2} \right) \end{matrix}$

[0067] Substituting M with {square root}{square root over (M)} and k with k/2 in Equation 1 yields Equation 2. This illustrates that reducing the order of M in MASK to {square root}{square root over (M)} produces the same power efficiency as that of QAM. Similarly, reducing the order of M in MASK to {square root}{square root over (M)} produces an improved power efficiency over MPSK. The MPSK BER for a coherent receiver in an AWGN channel is: $\begin{matrix} {P_{b} \approx {\frac{2}{k}{Q\left( {\sqrt{\frac{2{kE}_{b}}{N_{0}}}\sin \quad \frac{\pi}{M}} \right)}}} & \quad & ({MPSK}) \end{matrix}$

[0068]FIG. 3 compares MASK, MPSK and QAM on BER performance. Note that reducing the MASK order to {square root}{square root over (M)} leads to 0, 4, 10, and 16 dB power efficiency improvements compared to 4, 16, 64 and 256 PSK respectively.

[0069] The symbol rate (R_(S)) for MASK-OFDM is twice that of conventional QAM-OFDM since log₂M=2log₂{square root}{square root over (M)}. Thus, the bandwidth ratio of MASK over QAM or PSK becomes: ${BWR} = {\frac{N + 3}{N + 1} = {1 + \frac{2}{N + 1}}}$

[0070] For N=8, the bandwidth increase is about 22%. When N becomes very large (e.g., N=256) BWR increase is negligible (e.g., BWR=1.008).

[0071] In digital implementations, sampling frequency influences aliasing. For QAM-OFDM or MPSK-OFDM the highest null point in its PSD is f_(h)=N/T. The lowest null point frequency is f₁=−1/T. Thus, to avoid severe aliasing in the sampled modulated signal spectrum, a good sampling frequency is: $\begin{matrix} {{f_{s} \geq \left( {f_{h} - f_{l}} \right)} = {\frac{N + 1}{T} = \frac{\left( {N + 1} \right)R_{b}}{\log_{2}M}}} & \quad & \left( {{{QAM}\text{-}{OFDM}},{{MPSK}\text{-}{OFDM}}} \right) \end{matrix}$

[0072] where R_(b) is the bit rate of each channel. To further reduce aliasing, f_(s) is typically chosen higher than this. For example, f_(s) is typically chosen as 2N/T. If N is a power of 2, 2N samples in a symbol period can be generated by a 2N-point FFT with radix-2 algorithm. In terms of bit rate R_(b): $f_{s} = {\frac{2N}{T} = \begin{matrix} \frac{2{NR}_{b}}{\log_{2}M} & \quad & \left( {{{QAM}\text{-}{OFDM}},{{MPSK}\text{-}{OFDM}}} \right) \end{matrix}}$

[0073] Compare this to M-ary ASK OFDM. For MASK-OFDM, the highest null point in its PSD is f_(h)=(N+1)/(2T). The lowest null point frequency is f₁=−1/T. To avoid aliasing in the sampled modulated signal spectrum, an example sampling frequency is: $f_{s} \geq \left( \frac{N + 3}{2T} \right)$

[0074] For N≧3, which is satisfied in practical OFDM systems, $\frac{N + 3}{2T} \leq \frac{N}{T}$

[0075] Thus, the sampling frequency for a {square root}{square root over (M)}-ary ASK-OFDM can be selected as: $\begin{matrix} {f_{s} = {\frac{N}{T} = {\frac{{NR}_{b}}{\log_{2}\sqrt{M}} = \frac{2{NR}_{b}}{\log_{2}M}}}} & \quad & \left( {\sqrt{M}\text{-}{ary}\quad {ASK}\text{-}{OFDM}} \right) \end{matrix}$

[0076] For MASK-OFDM, using f_(s)=N/T instead of f_(s)=(N+3)/(2T), for big N the sampling frequency approximately doubles what was required, similar to QAM-OFDM and MPSK-OFDM. However, the complexity of a digital implementation of MASK-OFDM compared to the complexity of an implementation of QAM-OFDM or MPSK-OFDM is reduced since the samples per symbol is N for MASK-OFDM instead of 2N as for QAM-OFDM or MPSK-OFDM.

[0077] The example {square root}{square root over (M)}-ary ASK-OFDM systems and methods described herein facilitate reducing power requirements. Thus, for mobile devices, extended battery life is possible. Also, for some systems, reduced power requirements facilitate heat dissipation and increased miniaturization.

[0078] Orthogonality between different subcarriers in an OFDM system yields a total power that is the sum of the powers of the subcarriers P_(i), where: $P_{i} = {{\frac{1}{T}{\int_{0}^{T}{\left\lbrack {A_{i}{\cos \left( {{\omega_{i}t} + \varphi_{i}} \right)}} \right\rbrack^{2}{t}}}} = {\frac{1}{2}A_{i}^{2}}}$

[0079] Thus, the total average power equals the sum of the average powers of the subcarriers as in: $P_{{avg}{({OFDM})}} = {{E\left\{ P_{total} \right\}} = {{\sum\limits_{i = 0}^{N - 1}{E\left\{ P_{i} \right\}}} = {\sum\limits_{i = 0}^{N - 1}P_{avgi}}}}$

[0080] where E{x} denotes the statistical expectation of x.

[0081] Let AO represent MASK-OFDM, QO represent QAM-OFDM and PO represent PSK-OFDM. The average power of an equal amplitude spaced bipolar MASK signal on a subcarrier is: $P_{({avg})} = {\frac{1}{3T}\left( {M^{2} - 1} \right)A_{0}^{2}}$

[0082] where A₀ is the smallest amplitude on a normalized cosine (or sine) signal (e.g., {square root}{square root over (2/T)} cos(ωt)). For the amplitude assignment described above, A₀={square root}{square root over (2/T)} and the average power of the OFDM signal on N subcarriers is: $P_{{avg}{({AO})}} = {\frac{1}{6}{N\left( {M^{2} - 1} \right)}\quad \left( {0,\pi,{\pi/2}} \right)}$

[0083] Peak power is defined as the power of a sine (or cosine) wave with an amplitude equal to the maximum envelope value. Peak power occurs when the subcarriers have the same maximum amplitudes A_(max(MASK))=(M−1) and the same phase (0, π/2, π). Thus, the maximum envelope of the MASK-OFDM signal is equal to A_(peak(AO))=N(M−1). Thus, the peak to average power ratio (PAPR) is: ${PAPR}_{({AO})} = {\frac{P_{{peak}{({AO})}}}{P_{{avg}{({AO})}}} = {3N\frac{M - 1}{M + 1}}}$

[0084] For QAM, the maximum amplitude is A_(max(QAM))={square root}{square root over (2)}({square root}{square root over (M)}−1) (the outermost point in the constellation), the maximum OFDM envelope is A_(peak(QO))=N{square root}{square root over (2)}({square root}{square root over (M)}−1), and the peak power is P_(peak(QO))=N²({square root}{square root over (M)}−1)². The average power of the square QAM signal on a single subcarrier is P_(avg=)⅓(M−1)P₀, where P₀ is the power of the smallest signal. For the assumed amplitude assignment, P₀=½{square root}{square root over (2)}²=1. Thus the average power of the QAM-OFDM signal on N subcarriers is P_(avg(QO))=⅓N(M−1), and the PAPR is: ${PAPR}_{({QO})} = {\frac{P_{{peak}{({QO})}}}{P_{{avg}{({QO})}}} = \frac{3N\quad \left( {\sqrt{M} - 1} \right)}{\sqrt{M} + 1}}$

[0085] For MPSK, the amplitudes are the same, A_(MPSK). Thus, the maximum OFDM envelope is A_(peak(PO))=NA_(MPSK), and the peak power is P_(peak(PO))=½N²A² _(MPSK). The average power of the MPSK-OFDM signal on N subcarriers is P_(avg(PO))=½NA² _(MPSK). Thus, the PAPR is: ${PAPR}_{({PO})} = {\frac{P_{{peak}{({PO})}}}{P_{{avg}{({PO})}}} = N}$

[0086] Thus, the PAPR of the MASK-OFDM is increased over QAM by a factor of: $\frac{\quad \left( {\sqrt{M - 1}}^{2} \right)}{M + 1}$

[0087] Similarly, the PAPR of the MASK-OFDM is increased over MPSK by a factor of: $3\frac{\left( {M - 1} \right)}{M + 1}$

[0088] Thus, the {square root}{square root over (M)}-ary ASK OFDM systems and methods described herein achieve similar PAPR as MQAM-OFDM. Power efficiency losses can be recovered by reducing order M to {square root}{square root over (M)}. Furthermore, when compared with MPSK-OFDM, the MASK-OFDM systems and methods described herein increase PAPR while improving overall power efficiency.

[0089] Hardware and computational complexity are directly related to dollar and time cost for data communications systems and methods. Conventional QAM-OFDM and MPSK-OFDM are implemented with inverse discrete Fourier transform (IDFT). This implementation is hardware and computationally complex compared to MASK-OFDM. The system complexity is reduced since MASK is a one-dimensional modulation while QAM and PSK are two-dimensional modulations (see, for example, FIG. 15).

[0090] Conventional QAM-OFDM and MPSK-OFDM may employ FFT and IFFT, which employ complex number (e.g., real and imaginary components) operations. For an N-point FFT or IFFT, (N/2)log₂N complex number multiplications and Nlog₂N complex number additions are employed. An N-subcarrier QAM-OFDM or MPSK-OFDM requires a 2N-point IFFT/FFT, which requires N(log₂N+1) complex number multiplications and 2N(log₂N+1) complex additions.

[0091] The MASK-OFDM systems and methods described herein can employ a DCT and an IDCT. DCT and IDCT are a pair of orthogonal transforms that can be employed for modulating and demodulating MASK-OFDM signals. The DCT and IDCT can be implemented digitally and can manipulate real numbers instead of complex numbers as are used in FFT/IFFT implementations. This facilitates reducing hardware and computational complexity. In one example, the DCT and IDCT are implemented using an FCT and an IFCT. The FCT is a fast algorithm for implementing DCT.

[0092] An example DCT/IDCT pair are: $\begin{matrix} {{{{X(n)} = {\frac{2}{N}{ɛ(n)}{\sum\limits_{k = 0}^{N - 1}\quad {{x(k)}\cos \frac{\pi \quad {n\left( {{2k} + 1} \right)}}{2N}}}}},{n = 0},1,\quad \ldots \quad,{N - 1}}\quad} & ({DCT}) \\ {{{X(k)} = {\sum\limits_{n==0}^{N - 1}{{ɛ(n)}\quad {X(n)}\cos \frac{\pi \quad {n\left( {{2k} + 1} \right)}}{2N}}}},{k = 0},1,\quad \ldots \quad,{N - 1}} & ({IDCT}) \\ {{{where}\quad {ɛ(n)}} = \quad \left\{ \begin{matrix} {\frac{1}{\sqrt{2}},} & {n = 0} \\ {1,} & {otherwise} \end{matrix}\quad \right.} & \quad \end{matrix}$

[0093] In one example, to write the MASK-OFDM signal in the form of the DCT, first let t=n·Δt and T=N·Δt in the continuous time MASK-OFDM signal expression. ${s(t)} = {\sum\limits_{k = 0}^{N - 1}\quad {A_{k}\cos \quad 2\quad \pi \frac{k}{2T}t}}$

[0094] This converts the MASK-OFDM into discrete time form: ${s(n)} = {\sum\limits_{k = 0}^{N - 1}\quad {A_{k}\cos \frac{\pi \quad {n\left( {2k} \right)}}{2N}}}$

[0095] To employ the DCT, a frequency shift of 1/(4T) is introduced to each subcarrier. Therefore, redefine the MASK-OFDM signal as: $\begin{matrix} {{S(t)} = {{ɛ(t)}{\sum\limits_{k = 0}^{N - 1}\quad {A_{k}\cos \frac{{\pi \left( {{2k} + 1} \right)}t}{2T}}}}} \\ {{{where}\quad {ɛ(t)}} = \left\{ \begin{matrix} {\frac{1}{\sqrt{2}},{0 \leq t \leq {\Delta \quad t}}} \\ {1,{{\Delta \quad t} \leq t \leq T}} \end{matrix} \right.} \end{matrix}$

[0096] Using this redefinition and frequency shift, the subearrier frequencies become 1/(4T), 3/(4T), 5/(4T), . . . (2N−1)/(4T). These subcarrier frequencies are still 1/(2T), but the total signal bandwidth has been shifted up by 1/(4T). A discrete form of the redefined MASK-OFDM signal is: ${{s(n)} = {\frac{2}{N}{ɛ(n)}{\sum\limits_{k = 0}^{N - 1}{A_{k}\cos \frac{\pi \quad {n\left( {{2k} + 1} \right)}}{2N}}}}},{n = 0},1,\quad \ldots \quad,{N - 1}$

[0097] where 2/N is a constant. The discrete form employs a sampling frequency of N/T. MASK-OFDM in the form of ${s(t)} = {{ɛ(t)}{\sum\limits_{k = 0}^{N - 1}{A_{k}\cos \frac{{\pi \left( {{2k} + 1} \right)}t}{2T}}}}$

[0098] can be generated by an N-point FCT using: ${{s(n)} = {\frac{2}{N}{ɛ(n)}{\sum\limits_{k = 0}^{N - 1}{A_{k}\cos \frac{\pi \quad {n\left( {{2k} + 1} \right)}}{2N}}}}},{n = 0},1,\quad \ldots \quad,{N - 1}$

[0099] and can be demodulated using an N-point IFCT like: ${A_{k} = {\sum\limits_{n = 0}^{N - 1}{{ɛ(n)}{s(n)}\cos \frac{\pi \quad {n\left( {{2k} + 1} \right)}}{2N}}}},{k = 0},1,\quad \ldots \quad,{N - 1}$

[0100] One example algorithm for computing FCT/IFCT decomposes the N-point FCT or IFCT into two smaller N/2 point FCT or IFCT, and then decomposing further as desired. The example algorithm employs (N/2)log₂N real number multiplications and (3N/2)log₂N−N+1 real number additions. While the number of real number multiplications and additions for one example algorithm are described, it is to be appreciated that other FCT/IFCT algorithms may employ other mixes of real number multiplications, additions, and/or other operations.

[0101] Comparing these real number operations to conventional complex number operations facilitates understanding how the MASK-OFDM systems and methods described herein reduce hardware and/or computing complexity. Conventional QAM-OFDM and MPSK-OFDM may employ FFT and IFFT that employ complex number (e.g., real and imaginary components) operations. For an N-point FFT or IFFT, (N/2)log₂N complex number multiplications and Nlog₂N complex number additions are employed. An N-subcarrier QAM-OFDM or MPSK-OFDM requires a 2N-point IFFT/FFT, which requires N(log₂N+1) complex number multiplications and 2N(log₂N+1) complex additions. Thus, using the example algorithm, the number of multiplications and additions are reduced by about fifty percent. Furthermore, the type of operations are changed from complex number operations to real number operations, which can be implemented with less hardware and computing complexity.

[0102]FIG. 4 illustrates a system 400 that includes a MASK modulating component 410 and an OFDM multiplexing component 420. The MASK modulating component 410 may be a logic that receives a digital signal 430 (e.g., data signal) to be transmitted. The digital signal 430 can be, for example, binary data bits. The binary data bits can be mapped, for example, through a MASK mapping device to symmetrical bipolar M-ary ASK symbols that are then modulated on N subcarriers. The subcarriers are separated in frequency by half the symbol rate for orthogonality between the subcarriers. Component 410 modulates the digital signal 430 into M amplitude shift keyed signals, M being an integer. Since the digital signal 430 has been modulated into multiple signals, it is possible to multiplex those signals. Thus, the system 400 includes OFDM component 420. OFDM component 420 may be a logic that orthogonally frequency division multiplexes the amplitude shift keyed signals. In one example, the OFDM component 420 may be an adder. In one example, the MASK modulating component 410 and the OFDM multiplexing component 420 employ an FCT to implement a DCT for modulating the digital signal 430. The FCT may be implemented digitally.

[0103] After the digital signal 430 has been modulated and multiplexed, system 400 may interact with a transmitter (not illustrated) to transmit the orthogonally frequency division multiplexed amplitude shift keyed signals. In one example, the transmitter may be a wireless transmitter (e.g., transmit signals over the air via RF). It is to be appreciated that the transmitter may also transmit over one or more wires, one or more fiber optic cables, and so on. Thus, the transmitter, and the system 400 can be employed in systems including, but not limited to, wireless, wired, mobile, and satellite based systems.

[0104] The MASK modulating component 410 is operably connected to the OFDM component 420. The connection may be direct and/or indirect. Thus, signals may flow from the MASK modulating component 410 to the OFDM component 420 via zero or more intermediate digital communication components, logics, processes, flows, and so on. While two logics are displayed in FIG. 4 it is to be appreciated that the logics can be combined and/or distributed into a greater and/or lesser number of logics.

[0105] In one example, the MASK modulating component 410 takes k=log₂M bits from an input binary data stream and maps the bits into an amplitude level A_(i), which is one of the MASK signal points in the MASK constellation (see, for example, FIG. 15). The mapping may be, for example, Gray coding so that k-tuples representing the adjacent amplitudes differ by one bit. The mapping can be performed digitally, for example, through a look-up table. A data store may store the look-up table of M amplitude values. The k bits can be used as an address to fetch the corresponding amplitude value. The output is a binary number representing the amplitude value. This example implementation facilitates the operation of the digital implementation of the FCT.

[0106]FIG. 5 illustrates an example MASK-OFDM system. The system accepts a plurality of data streams (e.g., data streams 432 through data stream_(N−1) 436). Each data stream is then modulated by using digital communication components like an M-ary ask modulator (e.g., MASK modulator 412 through MASK modulator 416) and multiipliers (e.g., multiupliers 442 through 446). The modulated signals are then multiplexed through a multiplexer 450. In one example, the multiplexer 450 may be an adder. FIG. 5 illustrates the modulating and the multiplexing broken out into separate logical functions.

[0107]FIG. 6 illustrates a system in which the modulating and multiplexing are performed in a single logic 460 that implements a DCT. In one example, the DCT is implemented by an FCT. The logic 460 receives a plurality of data streams (e.g., data streams 432 through data stream_(N−1) 436). The data streams are then modulated and multiplexed and a plurality of samples of MASK-OFDM signals (e.g., samples 472 through sample_(N−1) 476) are produced.

[0108]FIG. 7 illustrates a modulation system 500. The modulation system 500 includes an M-ary amplitude shift key modulator 510 that receives a digital signal 530 to transmit and that modulates the digital signal 530 via amplitude shift keying into M amplitude shift keyed signals, M being an integer. The modulation system 500 also includes an orthogonal frequency division multiplexer 520 that frequency division multiplexes the amplitude shift key modulated signals.

[0109] The system 500 may include and/or interact with a transmitter (not shown) that transmits the frequency division multiplexed amplitude shift keyed signals. In one example, the modulator 510 and multiplexer 520 employ an FCT to implement a DCT for modulating the digital signal 530 into the amplitude shift keyed signals. The FCT can be implemented digitally, for example.

[0110] The modulator 510 is operably connected to the multiplexer 520. The connection may be direct and/or indirect. Thus, signals may flow from the modulator 510 to the multiplexer 520 via zero or more intermediate digital communication components, logics, processes, flows, and so on. While two logics are displayed in FIG. 5 it is to be appreciated that the logics can be combined and/or distributed into a greater and/or lesser number of logics.

[0111]FIG. 8 illustrates a system 600 that demodulates an orthogonally frequency division multiplexed signal. The system 600 includes a logic 620 that demultiplexes an orthogonally frequency division multiplexed signal 630 into M amplitude shift keyed signals. The system 600 also includes a logic 610 that demodulates the amplitude shift keyed signals into a digital signal. The digital signal may then be passed to other digital communication components.

[0112] In one example, the system 600 includes and/or interacts with a receiver (not shown) that receives the orthogonally frequency division multiplexed signal 630. The orthogonally frequency division multiplexed signal 630 may be carried, for example, on carrier frequencies that are separated by 1/(2T). In one example, the receiver may be a wireless receiver (e.g., receive signals over the air via RF). It is to be appreciated that the receiver may also receive signals over one or more wires, one or more fiber optic cables, and so on. Thus, the receiver, and the system 600 can be employed in systems including, but not limited to, wireless, wired, mobile, and satellite based systems.

[0113] In one example, the demodulating logic 610 employs an IFCT to perform an IDCT employed in demodulating. The IFCT can be implemented digitally, for example. The demodulating logic 610 is operably connected to the demultiplexing logic 620. The connection may be direct and/or indirect. Thus, signals may flow from the demultiplexing logic 620 to the demodulating logic 610 via zero or more intermediate computer components, logics, processes, flows, and so on. While two logics are displayed in FIG. 8 it is to be appreciated that the logics can be combined and/or distributed into a greater and/or lesser number of logics.

[0114] In one example, the demodulating logic 610 inputs the signals from the demultiplexing logic 620 and converts them into binary k-tuples via IFCT. The IFCT output is a binary number that represents an amplitude value in the MASK constellation (see, for example, FIG. 15). The binary k-tuple is the data bits represented by the amplitude. The de-mapping can be implemented digitally by, for example, employing a look-up table. A data store stores the look-up table of M k-tuples. The binary amplitude value can be employed as an address to fetch a corresponding k-tuple that contains the desired data bits.

[0115]FIG. 9 illustrates an example MASK-OFDM system. A MASK-OFDM signal is received by a power splitter 680. A plurality of signals are split by the power splitter 680 and demodulated using demodulating components like the low pass filters 662 through 666, the threshold detectors 652 through 656, the multiipliers 672 through 676 and so on. A plurality of data streams (e.g., data streams 642 through data stream_(N−1) 646) are produced. While FIG. 9 illustrates the demultiplexing and demodulating broken out into separate logical and physical operations, FIG. 10 illustrates an integrated system.

[0116]FIG. 10 illustrates an example MASK-OFDM system that receives a MASK-OFDM signal, samples it, and implements an IDCT to demultiplex and demodulate the MASK-OFDM signal. Once again, a plurality of data streams (e.g., data streams 642 through data stream_(N−1) 646) are produced. The system may employ digital communication components like threshold detectors 652 through 656.

[0117]FIG. 11 illustrates portions of a modulator/demodulator 700 that employs MASK-OFDM. The modulator/demodulator 700 includes a modulating logic 710 that receives a first digital signal 720 to be transmitted. The logic 710 modulates the first digital signal 720 into M first amplitude shift keyed signals, M being an integer, using, for example, a digitally implemented DCT. The DCT may be implemented, for example, by an FCT.

[0118] The modulator/demodulator 700 also includes a multiplexing logic 730 that orthogonally frequency division multiplexes the first amplitude shift keyed signals into a first multiplexed signal. The modulator/demodulator 700 includes a transmitter 740 that transmits the first multiplexed signal. The first multiplexed signal may be transmitted, for example, on carrier frequencies that are separated by 1/(2T).

[0119] The modulator/demodulator 700 also includes a receiver 750 that receives a second orthogonally frequency division multiplexed signal comprising M second amplitude shift keyed signals. The receiver 750 provides the multiplexed signal 760 to a demultiplexing logic 770 that demultiplexes the second orthogonally frequency division multiplexed signal into second amplitude shift keyed signals. The modulator/demodulator 700 also includes a demodulating logic 780 that accepts the demultiplexed signals. The logic 780 then demodulates the second amplitude shift keyed signals into a second digital signal using, for example, a digitally implemented IDCT. The IDCT may be implemented, for example, by an IFCT. While four logics are displayed in FIG. 7 it is to be appreciated that the logics can be combined and/or distributed into a greater and/or lesser number of logics.

[0120] In view of the examples shown and described herein, example methodologies that are implemented will be better appreciated with reference to the flow diagrams of FIGS. 12 and 13. While for purposes of simplicity of explanation, the illustrated methodologies are shown and described as a series of blocks, it is to be appreciated that the methodologies are not limited by the order of the blocks, as some blocks can occur in different orders and/or concurrently with other blocks from that shown and described. Moreover, less than all the illustrated blocks may be required to implement an example methodology. Furthermore, additional and/or alternative methodologies can employ additional, not illustrated blocks. In one example, methodologies are implemented as computer executable instructions and/or operations, stored on computer readable media including, but not limited to an application specific integrated circuit (ASIC), a compact disc (CD), a digital versatile disk (DVD), a random access memory (RAM), a read only memory (ROM), a programmable read only memory (PROM), an electronically erasable programmable read only memory (EEPROM), a disk, a carrier wave, and a memory stick.

[0121] In the flow diagrams, rectangular blocks denote “processing blocks” that may be implemented, for example, in software. Similarly, the diamond shaped blocks denote “decision blocks” or “flow control blocks” that may also be implemented, for example, in software. Alternatively, and/or additionally, the processing and decision blocks can be implemented in functionally equivalent circuits like a digital signal processor (DSP), an application specific integrated circuit (ASIC), and the like.

[0122] A flow diagram does not depict syntax for any particular programming language, methodology, or style (e.g., procedural, object-oriented). Rather, a flow diagram illustrates functional information one skilled in the art may employ to program software, design circuits, and so on. It is to be appreciated that in some examples, program elements like temporary variables, routine loops, and so on are not shown.

[0123]FIG. 12 illustrates a method 800 for modulating and multiplexing data. The method 800 includes, at 810, receiving a data signal to transmit. At 820, the method 800 modulates the signal via M-ary amplitude shift keying into M amplitude shift keyed signals, M being an integer. At 830, the method 800 includes multiplexing the M amplitude shift keyed signals into a multiplexed signal via orthogonal frequency division multiplexing.

[0124] In one example, the method 800 can include transmitting the multiplexed signal as, for example, at 840. At 850, a determination can be made whether the method is done. If the determination at 850 is YES, then processing concludes, otherwise processing can return to 810.

[0125] In one example, the modulating performed at 820 employs a DCT. The DCT can be implemented digitally, for example, by an FCT. Computer readable and/or executable instructions for the method 800 and/or portions thereof can be stored on a computer readable medium.

[0126]FIG. 13 illustrates a method 900 for demultiplexing and demodulating data. The method 900 includes, at 910, receiving an orthogonal frequency division multiplexed M-ary amplitude shift keyed data signal. At 920, the method 900 includes demultiplexing the frequency multiplexed M-ary amplitude shift keyed data signal into M amplitude shift keyed signals. At 930, the method 900 includes demodulating the M amplitude shift keyed signals into a data signal. In one example, the method 900 can include, as for example at 940, presenting the data signal to a computer component. In one example, the demodulating of 930 is performed using an IDCT. The IDCT can be implemented digitally, for example, by an IFCT.

[0127] The method 900 can include a determination of whether the method is complete. If the determination at 950 is YES, then processing concludes, otherwise processing continues at 910. Computer readable and/or executable instructions for the method 900 and/or portions thereof can be stored on a compute readable medium.

[0128]FIG. 14 illustrates a computer 1000 that includes a processor 1002, a memory 1004, a disk 1006, input/output ports 1010, and a network interface 1012 operably connected by a bus 1008. Executable components of the systems described herein may be located on a computer like computer 1000. Similarly, computer executable methods described herein may be performed on a computer like computer 1000. It is to be appreciated that other computers may also be employed with the systems and methods described herein. The processor 1002 can be a variety of various processors including dual microprocessor and other multi-processor architectures. The memory 1004 can include volatile memory and/or non-volatile memory. The non-volatile memory can include, but is not limited to, read only memory (ROM), programmable read only memory (PROM), electrically programmable read only memory (EPROM), electrically erasable programmable read only memory (EEPROM), and the like. Volatile memory can include, for example, random access memory (RAM), synchronous RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), and direct RAM bus RAM (DRRAM). The disk 1006 can include, but is not limited to, devices like a magnetic disk drive, a floppy disk drive, a tape drive, a Zip drive, a flash memory card, and/or a memory stick. Furthermore, the disk 1006 can include optical drives like, compact disk ROM (CD-ROM), a CD recordable drive (CD-R drive), a CD rewriteable drive (CD-RW drive) and/or a digital versatile ROM drive (DVD ROM). The memory 1004 can store processes 1014 and/or data 1016, for example. The disk 1006 and/or memory 1004 can store an operating system that controls and allocates resources of the computer 1000.

[0129] The bus 1008 can be a single internal bus interconnect architecture and/or other bus architectures. The bus 1008 can be of a variety of types including, but not limited to, a memory bus or memory controller, a peripheral bus or external bus, and/or a local bus. The local bus can be of varieties including, but not limited to, an industrial standard architecture (ISA) bus, a microchannel architecture (MSA) bus, an extended ISA (EISA) bus, a peripheral component interconnect (PCI) bus, a universal serial (USB) bus, and a small computer systems interface (SCSI) bus.

[0130] The computer 1000 interacts with input/output devices 1018 via input/output ports 1010. Input/output devices 1018 can include, but are not limited to, a keyboard, a microphone, a pointing and selection device, cameras, video cards, displays, and the like. The input/output ports 1010 can include but are not limited to, serial ports, parallel ports, and USB ports.

[0131] The computer 1000 can operate in a network environment and thus is connected to a network 1020 by a network interface 1012. Through the network 1020, the computer 1000 may be logically connected to a remote computer 1022. The network 1020 includes, but is not limited to, local area networks (LAN), wide area networks (WAN), and other networks. The network interface 1012 can connect to local area network technologies including, but not limited to, fiber distributed data interface (FDDI), copper distributed data interface (CDDI), ethernet/IEEE 802.3, token ring/IEEE 802.5, and the like. Similarly, the network interface 1012 can connect to wide area network technologies including, but not limited to, point to point links, and circuit switching networks like integrated services digital networks (ISDN), packet switching networks, and digital subscriber lines (DSL).

[0132]FIG. 15 illustrates the constellation of 8ASK that is used in one example and the constellation of 64QAM that is used in the IEEE 802.11 standard. The 8ASK constellation is one-dimensional while the 64QAM is two-dimensional. This facilitates simplifying modulation, demodulation, synchronization and other operations in the MASK-OFDM.

[0133] The systems and methods described herein may be stored, for example, on a computer readable media. Media can include, but are not limited to, an application specific integrated circuit (ASIC), a compact disc (CD), a digital versatile disk (DVD), a random access memory (RAM), a read only memory (ROM), a programmable read only memory (PROM), a disk, a carrier wave, a memory stick, and the like.

[0134] What has been described above includes several examples. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the methods, systems, computer readable media and so on employed in coherent MASK-OFDM data communication systems and methods. However, one of ordinary skill in the art may recognize that further combinations and permutations are possible. Accordingly, this application is intended to embrace alterations, modifications, and variations that fall within the scope of the appended claims.

[0135] Furthermore, to the extent that the term “includes” is employed in the detailed description or the claims, it is intended to be inclusive in a manner similar to the term “comprising” as that term is interpreted when employed as a transitional word in a claim. Further still, to the extent that the term “or” is employed in the claims (e.g., A or B) it is intended to mean “A or B or both”. When the author intends to indicate “only A or B but not both”, then the author will employ the term “A or B but not both”. Thus, use of the term “or” herein is the inclusive, and not the exclusive, use. See BRYAN A. GARNER, A DICTIONARY OF MODERN LEGAL USAGE 624 (2d Ed. 1995). 

What is claimed is:
 1. A system, comprising: a logic that modulates a received digital signal into M-ary amplitude shift keyed signals, M being an integer; and a logic that orthogonally frequency division multiplexes the M amplitude shift keyed signals.
 2. The system of claim 1 where the logic that modulates and the logic that multiplexes are one physical device.
 3. The system of claim 1, comprising: a transmitter that transmits the orthogonally frequency division multiplexed amplitude shift keyed signals.
 4. The system of claim 3, where the transmitter is a wireless transmitter.
 5. The system of claim 3, where the transmitter transmits over one or more wires.
 6. The system of claim 1, where the logic that modulates and the logic that multiplexes employ a discrete cosine transform to modulate and multiplex.
 7. The system of claim 6, where the discrete cosine transform is implemented digitally.
 8. The system of claim 6, where the discrete cosine transform is implemented by a fast cosine transform.
 9. The system of claim 3, where the transmitter transmits the multiplexed signals on subcarrier frequencies that are separated by 1/(2T).
 10. A system, comprising: means for MASK modulating a digital signal into a modulated digital signal; means for OFDM multiplexing the modulated digital signal into a, multiplexed digital signal; and a transmitter for transmitting the multiplexed digital signal.
 11. A digital communication system, comprising: an amplitude shift keying modulator that receives a digital signal to transmit and that amplitude shift keys the digital signal into M-ary amplitude shift keyed signals, M being an integer; and an orthogonal frequency division multiplexer that orthogonally frequency division multiplexes the M-ary amplitude shift key modulated signals.
 12. The system of claim 11, where the amplitude shift keying modulator and the orthogonal frequency division multiplexer are one physical device.
 13. The system of claim 11, comprising: a transmitter that transmits the orthogonally frequency division multiplexed M-ary amplitude shift keyed signals.
 14. The system of claim 11, where the modulator and the multiplexer employ a discrete cosine transform to modulate and multiplex.
 15. The system of claim 14, where the discrete cosine transform is implemented digitally.
 16. The system of claim 14, where the discrete cosine transform is implemented by a fast cosine transform.
 17. The system of claim 13, where the transmitter transmits the multiplexed signals on carrier frequencies that are separated by 1/(2T).
 18. The system of claim 13, where the transmitter is a wireless transmitter.
 19. The system of claim 13, where the transmitter transmits the multiplexed signals over one or more wires.
 20. The system of claim 13, where the transmitter transmits the multiplexed signals over one or more fiber optic cables.
 21. A system, comprising: a logic that demultiplexes an orthogonally frequency division multiplexed MASK signal into M amplitude shift keyed signals; and a logic that demodulates the M amplitude shift keyed signals into a digital signal.
 22. The system of claim 21 where the logic that demultiplexes and the logic that demodulates are one physical device.
 23. The system of claim 21, comprising: a receiver that receives the orthogonally frequency division multiplexed MASK signal.
 24. The system of claim 23, where the logic that demodulates and the logic that demultiplexes employ an inverse discrete cosine transform to demodulate and demultiplex.
 25. The system of claim 24, where the inverse discrete cosine transform is implemented digitally.
 26. The system of claim 24, where the inverse discrete cosine transform is implemented by an inverse fast cosine transform.
 27. The system of claim 25, where the orthogonally frequency division multiplexed MASK signal is carried on subcarrier frequencies that are separated by 1/(2T).
 28. A digital communication system, comprising: an orthogonal frequency division demultiplexer that demultiplexes an orthogonally frequency division multiplexed signal into M-ary amplitude shift keying modulated signals, M being an integer; and an amplitude shift keying demodulator that demodulates the M amplitude shift keying modulated signals.
 29. The system of claim 28, where the demultiplexer and the demodulator are located in one physical device.
 30. The system of claim 28, comprising: a receiver that receives the orthogonally frequency division multiplexed signal.
 31. The system of claim 28, where the demodulator and demultiplexer employ an inverse discrete cosine transform to demodulate or demultiplex.
 32. The system of claim 31, where the inverse discrete cosine transform is implemented digitally.
 33. The system of claim 31, where the inverse discrete cosine transform is implemented by an inverse fast cosine transform.
 34. The system of claim 30, where the orthogonally frequency division multiplexed signals are carried on subcarrier frequencies separated by l/(2T).
 35. The system of claim 30, where the receiver receives orthogonally frequency division multiplexed wireless signals.
 36. The system of claim 30, where the receiver receives the orthogonally frequency division multiplexed signal over one or more wires.
 37. The system of claim 30, where the receiver receives the orthogonally frequency division multiplexed signal over one or more fiber optic cables.
 38. A system, comprising: a receiver for receiving an orthogonally frequency division multiplexed signal; means for orthogonal frequency division demultiplexing the orthogonally frequency division multiplexed signal into M-ary amplitude shift keying modulated signals, M being an integer; and means for amplitude shift keying demodulating the M amplitude shift keying modulated signals.
 39. A method, comprising: modulating a digital signal via M-ary amplitude shift keying into M-ary amplitude shift keyed signals, M being an integer; and multiplexing the M amplitude shift keyed signals into a multiplexed signal via orthogonal frequency division multiplexing.
 40. The method of claim 39, where the modulating includes performing a discrete cosine transform.
 41. The method of claim 40, where the discrete cosine transform is implemented digitally.
 42. The method of claim 40, where the discrete cosine transform is implemented by a fast cosine transform.
 43. A computer readable medium storing computer executable instructions for the method of claim
 39. 44. A method, comprising: demultiplexing an orthogonally frequency division multiplexed MASK signal into M amplitude shift keying signals; and demodulating the M amplitude shift keying signals into a digital signal.
 45. The method of claim 44, where the demodulating and demultiplexing includes performing an inverse discrete cosine transform.
 46. The method of claim 45, where the inverse discrete cosine transform is implemented digitally.
 47. The method of claim 45, where the inverse discrete cosine transform is an inverse fast cosine transform.
 48. A computer readable medium storing computer executable instructions for the method for claim
 44. 49. A system, comprising: a logic that modulates a received first digital signal into first M-ary amplitude shift keyed signals, M being an integer; a logic that orthogonally frequency division multiplexes the first M-ary amplitude shift keyed signals into a first multiplexed signal; a transmitter that transmits the first multiplexed signal; a receiver that receives a second orthogonally frequency division multiplexed signal comprising M-ary second amplitude shift keyed signals; a logic that demultiplexes the second orthogonally frequency division multiplexed signal into second M-ary amplitude shift keyed signals; and a logic that demodulates the second M-ary amplitude shift keyed signals into a second digital signal.
 50. The system of claim 49, where the logic that modulates and the logic that multiplexes are located in one physical device and perform a fast cosine transform.
 51. The system of claim 49, where the logic that demultiplexes and the logic that demodulates are located in one physical device and perform an inverse fast cosine transform. 